Skolem Functions and Equality in Automated Deduction
نویسنده
چکیده
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to prevent paramodulation into subterms of Skolem expressions. A weak completeness result is presented (the functional reflexive axioms are assumed). Experimental results on problems in set theory, combinatory logic, Tarski geometry, and algebra show that the strategy can be useful when searching for refutations and when applying Knuth-Bendix completion. The emphasis of the paper is on the effectiveness of the strategy rather than on its completeness.
منابع مشابه
Unification procedures in automated deduction methods based on matings: A survey
Unification procedures arising in methods for automated theorem proving based on matings are surveyed. We begin by reviewing some fundamentals of automated deduction, including the Skolem form and the SkolemHerbrand-Gödel theorem. Next, the method of matings for first-order languages without equality due to Andrews and Bibel is presented. Standard unification is described in terms of transforma...
متن کاملGrigori Mints Thoralf Skolem and the Epsilon Substitution Method for Predicate Logic *
Skolem’s contributions to mathematical logic are fundamental and far-reaching. A good survey by Hao Wang (1970) is presented in Fenstad’s collection of Skolem’s works (1970). Even Skolemization, i.e. the replacement of quantifiers by new constant and function symbols, is too extensive for one talk. Cf. my survey (Mints 1990) of proof-theoretic aspects and more recent work (Shankar 1992) concern...
متن کاملGlobal Skolemization with grouped quantifiers (Abstract)
Elimination of quantifiers from formulae of classical first-order logic is a process with many implications in automated deduction [6, 1] and in foundational issues [4, 7]. When no particular theory is considered, quantifiers are usually eliminated by adopting Skolemization or the ε-operator. Traditionally, Skolemization and the ε-symbol have different, if not complementary, employments. Skolem...
متن کامل1980 - First Experiments with Rue Automated Deduction
RUE resolution represents a reformulation of binary resolution so that the basic rules of inference (RUE and NRF) incorporate the axioms of equality. An RUE theorem prover has been implemented and experimental results indicate that this method represents a significant advance in the handling of equality in resolution.
متن کاملMeta-theory of first-order predicate logic
We present a formalization of parts of Melvin Fitting’s book “FirstOrder Logic and Automated Theorem Proving” [1]. The formalization covers the syntax of first-order logic, its semantics, the model existence theorem, a natural deduction proof calculus together with a proof of correctness and completeness, as well as the Löwenheim-Skolem theorem.
متن کامل